Comparison of heuristics for flowtime minimisation in permutation flowshops
نویسندگان
چکیده
منابع مشابه
Comparison of heuristics for flowtime minimisation in permutation flowshops
We focus our attention on the problem of sequencing jobs in a permutation flow shop with the objective of minimising the sum of completion times or flowtime. This objective is considered to be more relevant and meaningful for today’s dynamic production environment, and therefore it has attracted the attention of researchers during the last years. As a result, a number of different types of heur...
متن کاملIterative Heuristics for Permutation Flow Shops with Total Flowtime Minimization
In this paper, flow shop scheduling problems with total flowtime minimization is considered. IRZ (iterative RZ, presented by Rajendran and Ziegler, EJOR, 1997) is found to be effective to improve solutions and LR (developed by Liu & Reeves, EJOR, 2001) is suitable for initial solution developing. By integrating FPE (forward pair wise exchange) and FPE-R(forward pair wise exchangerestart) with I...
متن کاملA comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
In recent years, a large number of heuristics have been proposed for the minimization of the total or mean flowtime/completion time of the well-known permutation flowshop scheduling problem. Although some literature reviews and comparisons have been made, they do not include the latest available heuristics and results are hard to compare as no common benchmarks and computing platforms have been...
متن کاملEvolutionary Clustering Search for Flowtime Minimization in Permutation Flow Shop
This paper deals with the Permutation Flow Shop scheduling problem with the objective of minimizing total flow time, and therefore reducing in-process inventory. A new hybrid metaheuristic Genetic Algorithm Cluster Search is proposed for the scheduling problem solution. The performance of the proposed method is evaluated and results are compared with the best reported in the literature. Experim...
متن کاملCrossing Minimisation Heuristics for 2-page Drawings
The minimisation of edge crossings in a book drawing of a graph G is one of important goals for a linear VLSI design, and the two-page crossing number of a graph G provides an upper bound for the standard planar crossing number. We propose several new heuristics for the 2-page drawing problem and test them on benchmark test sets like Rome graphs, Random Connected Graphs and some typical graphs....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2005
ISSN: 0305-0548
DOI: 10.1016/j.cor.2003.11.002